Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Throughout the academic year 1986-7, the University of Illinois was host to a symposium on mathematical analysis which was attended by some of the leading figures in the field. This book arises out of this special year and lays emphasis on the synthesis of modern and classical analysis. The contributed articles by the participants cover the gamut of mainstream topics. This book will be essential to researchers in mathematical analysis.

Mathematical analysis --- 517.1 Mathematical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This is an exposition of some special results on analytic or C8-approximation of functions in the strong sense, in finite- and infinite-dimensional spaces. It starts with H. Whitney's theorem on strong approximation by analytic functions in finite-dimensional spaces and ends with some recent results by the author on strong C8-approximation of functions defined in a separable Hilbert space. The volume also contains some special results on approximation of stochastic processes. The results explained in the book have been obtained over a span of nearly five decades.

Approximation theory. --- Mathematical analysis. --- Probabilities. --- Probability --- Statistical inference --- Combinations --- Mathematics --- Chance --- Least squares --- Mathematical statistics --- Risk --- 517.1 Mathematical analysis --- Mathematical analysis --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Approximation theory --- 517.1 --- Probabilities

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Graph Theory has proved to be an extremely useful tool for solving combinatorial problems in such diverse areas as Geometry, Algebra, Number Theory, Topology, Operations Research and Optimization. It is natural to attempt to generalise the concept of a graph, in order to attack additional combinatorial problems. The idea of looking at a family of sets from this standpoint took shape around 1960. In regarding each set as a ``generalised edge'' and in calling the family itself a ``hypergraph'', the initial idea was to try to extend certain classical results of Graph Theory such as the theorems o

Discrete mathematics --- Hypergraphs. --- Graph theory. --- Hypergraphs --- 517.98 --- 681.3*G22 --- 517.98 Functional analysis and operator theory --- Functional analysis and operator theory --- Graph theory --- 681.3*G22 Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems